Reduction about approximation spaces of covering generalized rough sets
نویسندگان
چکیده
منابع مشابه
Rough Entropy Based on Generalized Rough Sets Covering Reduction
In generalized rough set covering reduction theory, it is necessary to find a new measure to knowledge and rough set because the upper and lower approximations of rough sets are determined by their covering reduction. In this paper, information entropy is introduced to discuss the rough entropy of knowledge and the roughness of rough set, based on generalized rough set covering reduction. A new...
متن کاملTopological Spaces and Covering Rough Sets
Rough set theory (RST) is a modern tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. One of the limitations of RST is its dependence on portioning the universe according to equivalence relation on the universe of objects in information systems. The purpose of this paper is to construct connections between generalized rough sets based on cove...
متن کاملGeneralized Rough Sets in Contextual Spaces
KEY WORDS Contextual spaces, context relation, contextual rough sets, elements of a contextual rough set, the counterpart of the axiom of extensionality. ABSTRACT This paper originates from the conceptions of rough sets presented by Pawlak (1982, 1992). It also refers to Ziarko's conception (1993) and the conceptions of Blizard's multisets (1989a, 1989b), Zadeh's fuzzy sets (1965), and the auth...
متن کاملReduction of Neighborhood-Based Generalized Rough Sets
Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. This paper discusses five types of existing neighborhoodbased generalized rough sets. The concepts of minimal neighborhood description and maximal neighborhood description of an element are defined, and by means of the two concepts, the properties and structures...
متن کاملA Granular Reduction Algorithm Based on Covering Rough Sets
The granular reduction is to delete dispensable elements from a covering. It is an efficient method to reduce granular structures and get rid of the redundant information from information systems. In this paper, we develop an algorithm based on discernabilitymatrixes to compute all the granular reducts of covering rough sets. Moreover, a discernibility matrix is simplified to the minimal format...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2010
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2009.11.001